F IXED P ARAMETER S ET S PLITTING Fixed Parameter Set Splitting , Linear Kernel and Improved Running Time 1
نویسندگان
چکیده
We study the problem k-SET SPLITTING in fixed parameter complexity. We show that the problem can be solved in time O∗(2.6494k), improving on the best currently known running time of O∗(8k). This is done by showing that a non-trivial instance must have a small minimal SET COVER, and using this to reduce the problem to a series of small instances of MAX SAT. We also give a linear kernel containing 2k elements and 2k sets. This is done by reducing the problem to a bipartite graph problem where we use crown decomposition to reduce the graph. We show that this result also gives a good kernel for MAX CUT.
منابع مشابه
Fixed Parameter Set Splitting, Linear Kernel and Improved Running Time
We study the problem k-Set Splitting in fixed parameter complexity. We show that the problem can be solved in time O∗(2.6494k), improving on the best currently known running time of O∗(8k). This is done by showing that a non-trivial instance must have a small minimal Set Cover, and using this to reduce the problem to a series of small instances of Max Sat. We also give a linear kernel containin...
متن کاملFixed Parameter Set Splitting , Obtaining a Linear Kernel and Improving Running Time
We study the problem k-SET SPLITTING from a Fixed Parameter point of view. We give a linear kernel of 2k elements and 2k sets and improve on the current best running time for the problem, giving a O∗(4k) algorithm. This is done by reducing the problem to a bipartite graph problem where we use crown decomposition to reduce the graph. We show that this result also gives a good kernel for Max Cut.
متن کاملEven Faster Algorithm for Set Splitting!
In the p-Set Splitting problem we are given a universe U , a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that there are at least k sets in F that have non-empty intersection with both B and W . In this paper we study p-Set Splitting from the view point of kernelization and parameterized algorithms. Given an instance (U,F , k)...
متن کاملKernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems
In the Hitting Set problem, we are given a collection F of subsets of a ground set V and an integer p, and asked whether V has a p-element subset that intersects each set in F . We consider two parameterizations of Hitting Set below tight upper bounds: p = m − k and p = n − k. In both cases k is the parameter. We prove that the first parameterization is fixed-parameter tractable, but has no pol...
متن کاملLinear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
Suppose F is a finite family of graphs. We consider the following meta-problem, called FImmersion Deletion: given a graph G and integer k, decide whether the deletion of at most k edges of G can result in a graph that does not contain any graph from F as an immersion. This problem is a close relative of the F-Minor Deletion problem studied by Fomin et al. [FOCS 2012], where one deletes vertices...
متن کامل